Optimal Embedding of Hypercube into Cylinder

نویسندگان

چکیده

We study the problem of Embedding Wirelength $n$-dimensional Hypercube $Q_n$ into Cylinder $C_{2^{n_1}}\times P_{2^{n_2}}$, where $n_1+ n_2=n$, called EWHC. show that such wirelength corresponding to Gray code embedding is $2^{n_2}(3\cdot 2^{2n_1-3}-2^{n_1-1})+2^{n_1} (2^{2n_2-1}-2^{n_2-1})$. In addition, we prove an optimal strategy

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Embedding of Hypercube into Cylinder

Task mapping in modern high performance parallel computers can be modeled as a graph embedding problem, which simulates the mapping as embedding one graph into another and try to find the minimum wirelength for the mapping. Though embedding problems have been considered for several regular graphs, such as hypercubes into grids, binary trees into grids, et al, it is still an open problem for hyp...

متن کامل

Embedding complete trees into the hypercube

We consider embeddings of the complete t-ary trees of depth k (denotation T k,t) as subgraphs into the hypercube of minimum dimension n. This n, denoted by dim(T k,t), is known if max{k, t} ≤ 2. First we study the next open case max{k, t} = 3. We improve the known upper bound dim(T k,3) ≤ 2k + 1 up to limk→∞ dim(T k,3)/k ≤ 5/3 and derive the asymptotic limt→∞ dim(T 3,t)/t = 227/120. As a co-res...

متن کامل

Embedding ladders and caterpillars into the hypercube

We present embeddings of generalized ladders as subgraphs into the hypercube. By embedding caterpillars into ladders, we obtain embeddings of caterpillars into the hypercube. In this way we obtain almost all known results concerning the embeddings of caterpillars into the hypercube. In addition we construct embeddings for some new types of caterpillars.

متن کامل

A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube

The d-dimensional binary hypercube is a very popular model of parallel computation. On the other hand, the execution of many algorithms can be represented by binary trees, making desirable fast simulations of binary trees on hypercubes. In this paper, we present a simple one-to-one embedding of arbitrary binary trees into their optimal hypercubes with dilation 8 and constant congestion. The nov...

متن کامل

On Oriented Embedding of the Dichotomic Tree into the Hypercube

We consider the oriented dichotomic tree and the oriented hypercube. The tree edges are oriented from the root to the leaves, while the orientation of the cube edges is induced by the direction from 0 to 1 in the coordinatewise form. The problem is to embed such a tree with l levels into the oriented n-cube as an oriented subgraph, for minimal possible n. A new approach to such problems is pres...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Social Science Research Network

سال: 2022

ISSN: ['1556-5068']

DOI: https://doi.org/10.2139/ssrn.4013435